双37毫米舰炮射击终止时弹壳贴膛故障的分析及改进措施

分析了双３７舰炮射击终止时产生弹壳贴膛,退壳困难的故障,详细探讨故障产生原因,提出在装备使用过程中,使机械和电气的动作能相互制约,相互控制,避免射击终止时弹壳贴膛的改进措施。     

The stochastic single resource service‐provision problem

The service‐provision problem described in this paper comes from an application of distributed processing in telecommunications networks. The objective is to maximize a service provider's profit from offering computational‐based services to customers. The service provider has limited capacity and must choose which of a set of software applications he would like to offer. This can be done dynamically, taking into consideration that demand for the different services is uncertain. The problem is examined in the framework of stochastic integer programming. Approximations and complexity are examined for the case when demand is described by a discrete probability distribution. For the deterministic counterpart, a fully polynomial approximation scheme is known 2 . We show that introduction of stochasticity makes the problem strongly NP‐hard, implying that the existence of such a scheme for the stochastic problem is highly unlikely. For the general case a heuristic with a worst‐case performance ratio that increases in the number of scenarios is presented. Restricting the class of problem instances in a way that many reasonable practical problem instances satisfy allows for the derivation of a heuristic with a constant worst‐case performance ratio. Worst‐case performance analysis of approximation algorithms is classical in the field of combinatorial optimization, but in stochastic programming the authors are not aware of any previous results in this direction. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

在高校数学教育中应用数学案例教学的研究与实践

案例教学法是以案例为媒介的一种启发式教学方法。案例教学在数学教学中有重要作用，它有助于丰富和加深学生对数学理论知识的理解，把握好数学案例教学方法，对于培养和锻炼学生的分析解决实际问题的能力有着积极作用。     

Scheduling parallel machines with inclusive processing set restrictions and job rejection

In this article, we study a parallel machine scheduling problem with inclusive processing set restrictions and the option of job rejection. In the problem, each job is compatible to a subset of machines, and machines are linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process (but not conversely). To achieve a tight production due date, some of the jobs might be rejected at certain penalty. We first study the problem of minimizing the makespan of all accepted jobs plus the total penalty cost of all rejected jobs, where we develop a ‐approximation algorithm with a time complexity of . We then study two bicriteria variants of the problem. For the variant problem of minimizing the makespan subject to a given bound on the total rejection cost, we develop a ‐approximation algorithm with a time complexity of . For the variant problem of maximizing the total rejection cost of the accepted jobs subject to a given bound on the makespan, we present a 0.5‐approximation algorithm with a time complexity of . © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 667–681, 2017     

新课程理念下数学探究教学的理论与实践探索

数学探究教学作为新课程标准倡导的一种教学模式,它注重学生的参与体验,强调在教师的指导和点拨下展开具有探究性和一定创造性的教学活动。探究教学是发展学生个体,培养学生能力,提高学生素质的重要途径。另外,有关探究教学案例的开发也是不容忽视的一个重要方面。     

论贩毒案件的侦查方法

贩毒案件在各种毒品犯罪案件中居主导地位,公安机关非常重视对贩毒案件的侦查。通过对贩毒案件特点的分析,阐述了贩毒案件的侦查方法。     

指挥控制参考模型研究进展

介绍指挥控制参考模型领域取得的最新进展。在理论上分析了该模型体系结构的不足,引入了逻辑端口的概念。在应用上讨论了建模过程中层次的分拆、组合的原则,并将使用实例图引入该模型的理论研究和对实际系统的建模,取得了若干重要结论。     

某型25mm自动炮闩体阻挡抛壳现象分析

某型25mm自动炮存在闩体阻挡抛壳现象,为查找其原因,文章从自动炮结构到设计图纸进行了分析,找出了闩体下降滞后导致闩体阻挡抛壳的原因,并对闩体阻挡抛壳所带来后果及改进方法提出了看法。     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000